Coding schemes for the binary symmetric channel with known interference

We consider a binary symmetric channel with additive binary interference known to the transmitter but unknown to the receiver. Depending on whether the interference signal is known noncausally or causally, this channel falls in the cases studied by Gel’fand and Pinsker and by Shannon, respectively, for which coding theorems and single-letter capacity expressions are known. In this work we present effective code constructions for both problems. In particular, we show that the non-causal interference knowledge case can be turned into an equivalent binary multipleaccess channel, for which standard superposition coding and successive decoding can be used. We discuss also two alternatives for the causal interference knowledge case, one based on time-sharing and the other based on coding over a ternary alphabet with non-uniform probability assignment.